A note on chain lengths and the Tutte polynomial

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the tutte polynomial of benzenoid chains

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

متن کامل

on the tutte polynomial of benzenoid chains

the tutte polynomial of a graph g, t(g, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. in this paper a simple formula for computing tutte polynomial of a benzenoid chain is presented.

متن کامل

A note on some inequalities for the Tutte polynomial of a matroid

We prove that if a matroid M contains two disjoint bases (or, dually, if its ground set is the union of two bases), then TM (a, a) ≤ max{TM (2a, 0), TM (0, 2a)} for a ≥ 2. This resembles the conjecture that appears in C. Merino and D.J.A. Welsh, Forests, colourings and acyclic orientations of the square lattice, Annals of Combinatorics 3 (1999) pp. 417–429: If G is a 2-connected graph with no l...

متن کامل

The Tutte polynomial

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...

متن کامل

Fourientations and the Tutte polynomial

for α, γ ∈ {0, 1, 2} and β , δ ∈ {0, 1}. We introduce an intersection lattice of 64 cut–cycle fourientation classes enumerated by generalized Tutte polynomial evaluations of this form. We prove these enumerations using a single deletion–contraction argument and classify axiomatically the set of fourientation classes to which our deletion–contraction argument applies. This work unifies and exten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2008

ISSN: 0012-365X

DOI: 10.1016/j.disc.2006.09.049